Softness of hypercoherences and MALL full completeness

نویسندگان

  • Richard Blute
  • Masahiro Hamano
  • Philip J. Scott
چکیده

We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard’s ∗-autonomous category of hypercoherences. This is the first non-game-theoretic full completeness theorem for this fragment. Our main result is that every dinatural transformation between definable functors arises from the denotation of a cut-free MALL proof. Our proof consists of three steps. We show: • Dinatural transformations on this category satisfy Joyal’s softness property for products and coproducts. • Softness, together with multiplicative full completeness, guarantees that every dinatural transformation corresponds to a Girard MALL proof-structure. • The proof-structure associated to any dinatural transformation is a MALL proofnet, hence a denotation of a proof. This last step involves a detailed study of cycles in additive proof structures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A categorical semantics for polarized MALL

In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP, which is the linear fragment (without structural rules) of Olivier Laurent’s Polarized Linear Logic. Our model is based on an adjunction between reflective/coreflective full subcategories C−/C+ of an ambient ∗-autonomous category C (with products). Similar structures were first introduced by ...

متن کامل

Unifying static and dynamic denotational semantics

This work deals with semantics of programming languages (or equivalently, thanks to Curry-Howard isomorphism, with semantics of proofs). We introduce a framework in which both static semantics (Ehrhard’s hypercoherences) and dynamic semantics (Hyland-Ong’s games), can be presented. The work is carried in a multiplicative subsystem of Laurent’s polarized linear logic with weakening. Like Böhm tr...

متن کامل

Syntax vs. semantics: A polarized approach

We present a notion of sliced proof-nets for the polarized fragment of Linear Logic and a corresponding game model. We show that the connection between them is very strong through an equivalence of categories (this contains soundness, full completeness and faithful completeness). An important topic in the recent developments of denotational semantics has been the quest for stronger and stronger...

متن کامل

On the complexsity of some substructural logics

We use a syntactic interpretation of MALL in BCI with ∧, defined in [5], to prove the undecidability of the consequence relations for BCI with ∧ and BCI with ∨, and the NP-completeness of BCI. Similar results are obtained for a variant of the Lambek calculus.

متن کامل

Projecting Games on Hypercoherences

We compare two interpretations of programming languages: game semantics (a dynamic semantics dealing with computational traces) and hypercoherences (a static semantics dealing with results of computation). We consider polarized bordered games which are Laurent’s polarized games endowed with a notion of terminated computation (the border) allowing for a projection on hypercoherences. The main re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 131  شماره 

صفحات  -

تاریخ انتشار 2005